99 research outputs found
Palindromic complexity of trees
We consider finite trees with edges labeled by letters on a finite alphabet
. Each pair of nodes defines a unique labeled path whose trace is a
word of the free monoid . The set of all such words defines the
language of the tree. In this paper, we investigate the palindromic complexity
of trees and provide hints for an upper bound on the number of distinct
palindromes in the language of a tree.Comment: Submitted to the conference DLT201
Shuffle operations on discrete paths
AbstractWe consider the shuffle operation on paths and study some parameters. In the case of square lattices, shuffling with a particular periodic word (of period 2) corresponding to paperfoldings reveals some characteristic properties: closed paths remain closed; the area and perimeter double; the center of gravity moves under a 45∘ rotation and a 2 zoom factor. We also observe invariance properties for the associated Dragon curves. Moreover, replacing square lattice paths by paths involving 2kπ/N-turns, we find analogous results using more general shuffles
- …